Nonadditive Set Functions on a Finite Set and Linear Inequalities

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterating Random Functions on a Finite Set

Choose random functions f1, f2, f3, . . . independently and uniformly from among the nn functions from [n] into [n]. For t > 1, let gt = ft ◦ ft−1 ◦ · · · ◦ f1 be the composition of the first t functions, and let T be the smallest t for which gt is constant(i.e. gt(i) = gt(j) for all i, j). The goal of this paper is to determine the asymptotic distribution of T . We prove that, for any positive...

متن کامل

Interaction Transform of Set Functions over a Finite Set

The paper introduces a new transform of set functions over a finite set, which is linear and invertible as the well known Möbius transform in combinatorics. This transform leads to the interaction index, a central concept in multicriteria decision making. The interaction index of a singleton happens to be the Shapley value of the set function or, in terms of cooperative game theory, of the valu...

متن کامل

Interaction transform for bi-set functions over a finite set

Set functions appear as a useful tool in many areas of decision making and operations research, and several linear invertible transformations have been introduced for set functions, such as the Möbius transform and the interaction transform. The present paper establish similar transforms and their relationships for bi-set functions, i.e. functions of two disjoint subsets. Bi-set functions have ...

متن کامل

A Finite Set of Discrete Functions

Wolpert and Macready’s No Free Lunch theorem proves that no search algorithm is better than any other over all possible discrete functions. The meaning of the No Free Lunch theorem has, however, been the subject of intense debate. We prove that for local neighborhood search on problems of bounded complexity, where complexity is measured in terms of number of basins of attraction in the search s...

متن کامل

On Compositions of Random Functions on a Finite Set

We establish the limiting distribution of the number Tn of random functions on a set of size n which must be composed before a constant function results. In more detail, let f1, f2, . . . be independent draws from the uniform distribution over all functions from {1, . . . , n} into itself. For t = 1, 2, . . . let gt := ft ◦ · · · ◦ f2 ◦ f1 denote the composition of the first t random maps, and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1997

ISSN: 0022-247X

DOI: 10.1006/jmaa.1997.5414